On the weighted trees with given degree sequence and positive weight set

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The p-Laplacian spectral radius of weighted trees with a degree sequence and a weight set

In this paper, some properties of the discrete p-Laplacian spectral radius of weighted trees have been investigated. These results are used to characterize all extremal weighted trees with the largest p-Laplacian spectral radius among all weighted trees with a given degree sequence and a positive weight set. Moreover, a majorization theorem with two tree degree sequences is presented.

متن کامل

Diameter Two Graphs of Minimum Order with Given Degree Set

The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...

متن کامل

The Number of Subtrees of Trees with Given Degree Sequence

This article investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalize the recent results of Kirk and Wang (SIAM J Discrete Math 22 (2008), 985–995). These trees coincide with those which were proven by Wang and independently Z...

متن کامل

Ela the P -laplacian Spectral Radius of Weighted Trees with a Degree Sequence and a Weight Set∗

In this paper, some properties of the discrete p-Laplacian spectral radius of weighted trees have been investigated. These results are used to characterize all extremal weighted trees with the largest p-Laplacian spectral radius among all weighted trees with a given degree sequence and a positive weight set. Moreover, a majorization theorem with two tree degree sequences is presented.

متن کامل

The ABC Index of Trees with Given Degree Sequence∗

The atom–bond connectivity index of a graph G is defined as

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2010

ISSN: 0024-3795

DOI: 10.1016/j.laa.2010.03.009